effici influenc maxim social network wei chen yajun wang siyu yang influenc maxim problem find small subset node seed node social network maxim spread influenc paper studi effici influenc maxim complementari direct improv origin greedi algorithm improv reduc run time propos degre discount heurist improv influenc spread evalu algorithm experi larg academ collabor graph obtain onlin archiv databas arxiv org experiment result show improv greedi algorithm achiev run time compar improv match influenc spread degre discount heurist achiev influenc spread classic degre central base heurist tune specif influenc cascad model achiev match influenc thread greedi algorithm importantli degre discount heurist run millisecond improv greedi algorithm run hour experi graph ten thousand node base result fine tune heurist provid scalabl solut influenc maxim problem satisfi influenc spread blazingli fast run time contrari impli conclus tradit heurist outperform greedi approxim algorithm result shed light research heurist algorithm 